A provably efficient algorithm for dynamic storage allocation
نویسندگان
چکیده
منابع مشابه
A provably efficient simplex algorithm for classification
We present a simplex algorithm for linear programming in a linear classification formulation. The paramount complexity parameter in linear classification problems is called the margin. We prove that for margin values of practical interest our simplex variant performs a polylogarithmic number of pivot steps in the worst case, and its overall running time is near linear. This is in contrast to ge...
متن کاملEvaluating the Local Ratio Algorithm for Dynamic Storage Allocation
We empirically compare the local ratio algorithm for the proot maximization version of the dynamic storage allocation problem against various greedy algorithms. Our main conclusion is that, at least on our input distributions, the local ratio algorithms performed worse on average than the more naive greedy algorithms.
متن کاملAn algorithm with constant execution time for dynamic storage allocation
The predictability of the computation t ime of program modules is very important f o r estimating an accurate worst-case execution t ime ( W C E T ) of a task in real-time systems. Dynamic storage allocation ( D S A ) is a common programming technique. Although many DSA algorithms have been developed, they focus o n the average execution t ime rather than the W C E T , making it is very dif icu...
متن کاملA genetic algorithm approach for a dynamic cell formation problem considering machine breakdown and buffer storage
Cell formation problem mainly address how machines should be grouped and parts be processed in cells. In dynamic environments, product mix and demand change in each period of the planning horizon. Incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. In this model, to ensure the reliability of the system in presence of unreliable machine...
متن کاملDevelopment of Efficient Dynamic Bandwidth Allocation Algorithm for XGPON
(EBU) algorithm that utilizes the unused bandwidth in dynamic bandwidth allocation (DBA) of a 10-gigabitcapable passive optical network (XGPON). In EBU, an available byte counter of a queue can be negative and the unused remainder of an available byte counter can be utilized by the other queues. In addition, EBU uses a novel polling scheme to collect the requests of queues as soon as possible. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90031-7